Single hoist cyclic scheduling with multiple tanks: a material handling solution

نویسندگان

  • Zhili Zhou
  • Ling Li
چکیده

A hoist controlled by a computer is widely used for moving electroplates which is chemically treated in a sequence of tanks. The hoist scheduling directly a.ects the throughput of a production system. The objective of the hoist scheduling problem is to schedule the moves to maximize the throughput. This paper investigates the hoist scheduling problem, a speci2c material handling issue, in a manufacturing environment. The scope of the study is in the area of single hoist cyclic scheduling with multiple tanks. The purpose of the study is to develop a mixed integer linear programming model that can be used to schedule multiple tanks and improve throughput in a process industry. Speci2cally, a method has been proposed to estimate the processing time in a bottleneck stage with multiple tanks. ? 2002 Elsevier Science Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A genetic algorithm approach for a single hoist scheduling problem with time windows constraints

This study considers a cyclic scheduling of hoist movements in electroplating industry. Several jobs have to flow through a production line according to an ordered bath sequence. They firstly enter the line at a loading buffer. Then they will be soaked sequentially in a series of tanks containing specific chemical baths. Finally, they will leave the line at the unloading buffer. The processing ...

متن کامل

Coupling Hoist Scheduling and Production Line Arrangement for Productivity Maximization

Hoist scheduling is an important element for productivity maximization in multi-stage material handling processes, especially in electroplating system. However, the productivity of a multi-stage process not only depends on the hoist schedule, but also substantially relies on the production line arrangement, i.e., the design for spatial allocations of various processing units. In this paper, an ...

متن کامل

A New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic

In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...

متن کامل

A Generic Model and Hybrid Algorithm for Hoist Scheduling Problems

This paper presents a robust approach to solve Hoist Scheduling Problems (HSPs) based on an integration of Constraint Logic Programming (CLP) and Mixed Integer Programming (MIP). By contrast with previous dedicated models and algorithms for solving classes of HSPs, we deene only one model and run diierent solvers. The robust approach is achieved by using a CLP formalism. We show that our models...

متن کامل

Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach

An analytical mathematical model and a branch-and-bound algorithm for singletrack cyclic multi-hoist scheduling problems are proposed. The objective is to minimize the cycle time for a given number of hoists. The collision-free single-track constraints are first formulated as disjunctive inequalities. It is then shown that this formulation is a very strict and necessary condition. To be a suffi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & OR

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2003